The pickup and delivery problem with alternative locations and overlapping time windows
نویسندگان
چکیده
Online second-hand marketplaces have seen a vast increase in transactions recent years, although sending and receiving parcels can be an inconvenience for private buyers sellers C2C settings. To facilitate transportation providers expanding their product portfolio with alternative concepts, we consider the pickup delivery problem (PDP) locations overlapping time windows. The requests to served by fleet of homogeneously capacitated vehicles. Each request may multiple roaming throughout day non-overlapping windows (since cannot two places at once). A also many locations, additionally recipient own set locations. As such, several persons different available simultaneously accept delivery. Recipients could use 24-hour locker boxes if these are conveniently located. We propose solution approach based on multi-start, adaptive, large neighborhood search specific operators, solve compare our algorithm similar problems from literature examine detail scenarios real data provided Austrian logistics provider. In particular, explore benefits boxes, recipients, mixed customer profiles preferences concerning sharing convenience. found that flexibility convenience customers translates into cost savings up almost 30% carriers.
منابع مشابه
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows
In the pickup and delivery problem with time windows (PDPTW), vehicle routes must be designed to satisfy a set of transportation requests, each involving a pickup and a delivery location, under capacity, time window, and precedence constraints. This paper introduces a new branch-and-cut-and-price algorithm in which lower bounds are computed by solving through column generation the linear progra...
متن کاملThe Bi-Objective Location-Routing Problem based on Simultaneous Pickup and Delivery with Soft Time Window
The location-routing problem is the most significant and yet new research field in location problems that considers simultaneously vehicle routing problem features with original one for achieving high-quality integrated distribution systems in beside of the global optimum. Simultaneous pickup and delivery based on time windows are the two main characteristics of logistic management that have be...
متن کاملA branch-and-price algorithm for the pickup and delivery problem with time windows
In pickup and delivery problems vehicles have to transport loads from origins to destinations without transshipment at intermediate locations. In this paper, we describe an algorithm to solve such problems. The algorithm is based on a set partitioning formulation of the problem and uses new column generation and branching schemes.
متن کاملSolving the Pickup and Delivery Problem with Time Windows by Branch-and-Cut
In the Vehicle Routing Problem with Pickup and Delivery (VRPPD), a set of transportation requests must be satisfied by capacitated vehicles based at one or several depots. Each request is defined by an origin (or pickup point), a destination (or delivery point), and a demand to be transported from the origin to the destination. Typical applications are parcel services and dial-a-ride transporta...
متن کاملEvolutionary Multiobjective Optimization for the Pickup and Delivery Problem with Time Windows and Demands
This paper studies an evolutionary algorithm to solve a new multiobjective optimization problem, the Pickup and Delivery Problem with Time Windows and Demands (PDPTW-D), which extends PDP and PDP-TW. With respect to multiple optimization objectives, PDP-TW-D is to find a set of Pareto-optimal routes for a fleet of vehicles in order to serve given transportation requests. The proposed algorithm ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2022
ISSN: ['0305-0548', '1873-765X']
DOI: https://doi.org/10.1016/j.cor.2022.105758